On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
نویسندگان
چکیده
We show that deciding square-freeness of a sparse univariate polynomial over ZZ and over the algebraic closure of a nite eld IFq of p elements is NP-hard. We also discuss some related open problems about sparse polynomials.
منابع مشابه
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program
In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many efficient algorithms to test if a given string is square-free, have been developed so far. However, very little is known for testing square-freen...
متن کاملAn Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program
In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many efficient algorithms to test if a given string is square-free, have been developed so far. However, very little is known for testing square-freen...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملEmbedding Hard Learning Problems Into Gaussian Space
We give the first representation-independent hardness result for agnostically learning halfspaces with respect to the Gaussian distribution. We reduce from the problem of learning sparse parities with noise with respect to the uniform distribution on the hypercube (sparse LPN), a notoriously hard problem in theoretical computer science and show that any algorithm for agnostically learning halfs...
متن کاملAn Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs
In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = uk implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. However, very little is known for testing square-freeness of a given compressed string. In this paper, we give an O(max(n2,n log2 N))-time O(n2)-spac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999